On the Serializability Theorem for Nested Transactions

The fundamental theorem of the classical serializability theory states the necessary and suucient conditions for the connict serializability of an execution. In this paper, we extend the correctness criteria of the classical theory by presenting a deenition of connict serializability for concurrency control of nested transactions. We deene a serialization graph for nested transactions and we prove that its acyclicity is a suucient and necessary condition for connict serializability.